A spanning tree cohomology theory for links
نویسندگان
چکیده
منابع مشابه
Legendrian links and the spanning tree model for Khovanov homology
The Khovanov homology has led to many interesting new developments in knot theory and related fields. See Lee [4, 5], Ng [6], Plamenevskaya [7] and Rasmussen [8] for examples. It is still very difficult to compute the Khovanov homology in general. Recently, A Champanerkar and I Kofman [2] and, independently, S Wehrli [11] constructed a spanning tree model for the Khovanov homology based on the ...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملApplying Spanning Tree Graph Theory for Automatic Database Normalization
In Knowledge and Data Engineering field, relational database is the best repository to store data in a real world. It has been using around the world more than eight decades. Normalization is the most important process for the analysis and design of relational databases. It aims at creating a set of relational tables with minimum data redundancy that preserve consistency and facilitate correct ...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملA Spanning Tree Invariant for Markov Shifts
We introduce a new type of invariant of block isomorphism for Markov shifts, defined by summing the weights of all spanning trees for a presentation of the Markov shift. We give two proofs of invariance. The first uses the Matrix-Tree Theorem to show that this invariant can be computed from a known invariant, the stochastic zeta function of the shift. The second uses directly the definition to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2014
ISSN: 0001-8708
DOI: 10.1016/j.aim.2014.01.006